Drawing outerplanar graphs
نویسندگان
چکیده
It is shown that for any outerplanar graph G there is a one to one mapping of the vertices of G to the plane, so that the number of distinct distances between pairs of connected vertices is at most three. This settles a problem of Carmi, Dujmovic, Morin and Wood. The proof combines (elementary) geometric, combinatorial, algebraic and probabilistic arguments.
منابع مشابه
Proximity Drawings of Outerplanar Graphs ( Preliminary
A proximity drawing of a graph is one in which pairs of adjacent vertices are drawn relatively close together according to some proximity measure while pairs of non-adjacent vertices are drawn relatively far apart. The fundamental question concerning proximity drawability is: Given a graph G and a deenition of proximity, is it possible to construct a proximity drawing of G? We consider this que...
متن کاملOn the Edge-Length Ratio of Outerplanar Graphs
We show that any outerplanar graph admits a planar straightline drawing such that the length ratio of the longest to the shortest edges is strictly less than 2. This result is tight in the sense that for any > 0 there are outerplanar graphs that cannot be drawn with an edge-length ratio smaller than 2 − . We also show that every bipartite outerplanar graph has a planar straight-line drawing wit...
متن کاملStraight-Line Grid Drawings of Label-Constrained Outerplanar Graphs with O(n log n) Area
A straight-line grid drawing of a planar graph G is a drawing of G on an integer grid such that each vertex is drawn as a grid point and each edge is drawn as a straight-line segment without edge crossings. Any outerplanar graph of n vertices with maximum degree d has a straight-line grid drawing with area O(dn log n). In this paper, we introduce a subclass of outerplanar graphs, which we call ...
متن کاملPlanar Lombardi Drawings of Outerpaths
A Lombardi drawing of a graph is a drawing where edges are represented by circular arcs that meet at each vertex v with perfect angular resolution 360◦/deg(v) [3]. It is known that Lombardi drawings do not always exist, and in particular, that planar Lombardi drawings of planar graphs do not always exist [1], even when the embedding is not fixed. Existence of planar Lombardi drawings is known f...
متن کاملAlgebraic characterizations of outerplanar and planar graphs
A drawing of a graph in the plane is even if nonadjacent edges have an even number of intersections. Hanani’s theorem characterizes planar graphs as those graphs that have an even drawing. In this paper we present an algebraic characterization of graphs that have an even drawing. Together with Hanani’s theorem this yields an algebraic characterization of planar graphs. We will also present alge...
متن کاملOuterplanar Graph Drawings with Few Slopes
We consider straight-line outerplanar drawings of outerplanar graphs in which a small number of distinct edge slopes are used, that is, the segments representing edges are parallel to a small number of directions. We prove that ∆ − 1 edge slopes suffice for every outerplanar graph with maximum degree ∆ > 4. This improves on the previous bound of O(∆), which was shown for planar partial 3-trees,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013